Calculating safety stocks for assembly systems with random component procurement lead times: A branch and bound algorithm

نویسندگان

  • Mohamed Aly Ould Louly
  • Alexandre Dolgui
چکیده

In this paper, a discrete single-level multi-component inventory control model for assembly systems with random component procurement lead times is considered. The economic order quantity (EOQ) policy is used for a type of finished product. The requirements of the components are constant and cyclic (periodic), and their values per period are deduced from the EOQ for the finished product. The paper focuses on the components safety stock calculation. The objective is to minimise the average holding cost of the components while keeping the desired service level for the finished product. For this, an upper bound, two lower bounds, two dominance properties and an efficient branch and bound algorithm are suggested. Several tests are executed and conclusions are drawn. The proposed model provides a substantial saving for assembly systems with a large number and unreliable delivery of components as in semi-conductor and automotive industries. 2008 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A modified branch and bound algorithm for a vague flow-shop scheduling problem

Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...

متن کامل

An Approach for the MRP Parameterization Under Lead Time Uncertainty: Branch and Cut Algorithm

Inventory control in a Supply chain is crucial for companies who wish to satisfy their customer demands on time as well as controlling costs. A common approach is to use the MRP techniques. However, these techniques are based on the supposition that lead times are known. In a Supply chain the lead times are often random variables. Therefore, an efficient exact approach to aid in MRP parameteriz...

متن کامل

A Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect

Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...

متن کامل

A POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE

The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...

متن کامل

Multi-Objective Lead Time Control in Multistage Assembly Systems (TECHNICAL NOTE)

In this paper we develop a multi-objective model to optimally control the lead time of a multistage assembly system. The multistage assembly system is modeled as an open queueing network, whose service stations represent manufacturing or assembly operations. The arrival processes of the individual parts of the product, which should be assembled to each other in assembly stations, are assumed to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 199  شماره 

صفحات  -

تاریخ انتشار 2009